Maximal Sets of Integers with Distinct Divisors
نویسندگان
چکیده
Let S denote a set of positive integers and τ : S → be defined so that τ(s) is a proper divisor of s (that is, τ(s) divides s and τ (s) < s). The ensemble (S, τ ) is said to have the ‘distinct divisor property’ if τ is injective, that is, if the τ (s) are different for different values of s. We will also say that S has the distinct divisor property if there exists a τ , as above, such that (S, τ) has the distinct divisor property. Let c > 1 denote a real number and N a large natural number. Let S be a subset of [N, cN ] with the distinct divisor property such that, of all subsets of [N, cN ] having distinct divisors, S has maximal cardinality. If c is fixed and N tends to infinity then P. Erdős and C. Pomerance, [1], have shown that
منابع مشابه
Consecutive Integers with Equally Many Principal Divisors
Classifying the positive integers as primes, composites, and the unit, is so familiar that it seems inevitable. However, other classifications can bring interesting relationships to our attention. In that spirit, let us classify positive integers by the number of principal divisors they possess, where we define a principal divisor of a positive integer n to be any prime-power divisor pa|n which...
متن کاملMaximal sets of integers not containing k + 1 pairwise coprimes and having divisors from a specified set of primes
We find the formula for the cardinality of maximal set of integers from [1,. .. , n] which does not contain k + 1 pairwise coprimes and has divisors from a specified set of primes. This formula is defined by the set of multiples of the generating set, which does not depend on n. 1 Formulation of the result Let P = {p 1 < p 2 ,. . .} be the set of primes and N be the set of natural numbers. Writ...
متن کاملOn a class of arithmetic convolutions involving arbitrary sets of integers
Let d, n be positive integers and S be an arbitrary set of positive integers. We say that d is an S-divisor of n if d|n and gcd (d, n/d) ∈ S. Consider the S-convolution of arithmetical functions given by (1.1), where the sum is extended over the S-divisors of n. We determine the sets S such that the S-convolution is associative and preserves the multiplicativity of functions, respectively, and ...
متن کاملOn Integers for Which the Sum of Divisors is the Square of the Squarefree Core
We study integers n > 1 satisfying the relation σ(n) = γ(n)2, where σ(n) and γ(n) are the sum of divisors and the product of distinct primes dividing n, respectively. We
متن کاملSome Problems of Erdős on the Sum-of-divisors Function
Let σ(n) denote the sum of all of the positive divisors of n, and let s(n) = σ(n)− n denote the sum of the proper divisors of n. The functions σ(·) and s(·) were favorite subjects of investigation by the late Paul Erdős. Here we revisit three themes from Erdős’s work on these functions. First, we improve the upper and lower bounds for the counting function of numbers n with n deficient but s(n)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 2 شماره
صفحات -
تاریخ انتشار 1995